Complexity to get Lower Bounds on Branching Program
نویسنده
چکیده
منابع مشابه
Complexity and its Application to Lower Bounds on Branching Program
Multiparty communication complexity was first defined by Chandra, Furst, and Lipton [6] and used to obtain lower bounds on branching programs. Since then it has been used to get additional lower bounds and tradeoffs for branching programs [1, 3], lower bounds on problems in data structures [3], time-space tradeoffs for restricted Turing machines [1], and unconditional pseudorandom generators fo...
متن کاملCompression of Boolean Functions
We consider the problem of compression for “easy” Boolean functions: given the truth table of an n-variate Boolean function f computable by some unknown small circuit from a known class of circuits, find in deterministic time poly(2) a circuit C (no restriction on the type of C) computing f so that the size of C is less than the trivial circuit size 2/n. We get both positive and negative result...
متن کاملCoding-Theoretic Lower Bounds for Boolean Branching Programs
We develop a general method for proving lower bounds on the complexity of branching programs. The proposed proof technique is based on a connection between branching programs and error-correcting codes and makes use of certain classical results in coding theory. Specifically, lower bounds on the complexity of branching programs computing certain important functions follow directly from lower bo...
متن کاملRamsey Theory and lower bounds for branching programs
A novel technique for obtaining lower bounds for the time versus space comp1exity of certain functions in a general input oblivious sequential model of computation is developed. This is demonstrated by studying the intrinsic complexity of the following set equality problem SE(n,m): Given a sequence x1 ,x2 ,· .• ,xn ' Yl'·· .'Yn of 2n numbers of m bits each, decide whether the sets (xl' ••• ,xnJ...
متن کاملSuperlinear Lower Bounds for Bounded-Width Branching Programs
We use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, we show that any bounded-width branching program computing a nonconstant threshold function has length (n log log n); improving on the previous lower bounds known to apply to all such threshold functions. We also show that any program over ...
متن کامل